Fast mapping algorithm for histogram to binary set conversion
نویسندگان
چکیده
In this paper, a fast binary set mapping (FBSM) algorithm is proposed for expediting the conversion from histograms to binary color sets. In comparison with the original mapping scheme, signi®cant reduction in the computation complexity can be achieved. Such an ecient mapping algorithm justi®es the practical usage of the pre®ltering technique in the application to histogram-based image retrieval systems, especially to searching large image databases. Ó 2000 Published by Elsevier Science B.V. All rights reserved.
منابع مشابه
Optimal DC Fast Charging Placing And Sizing In Iran Capital (Tehran)
DC fast charging (DCFC) and optimal placing of them is a fundamental factor for the popularization of electric vehicles (EVs). This paper proposes an approach to optimize place and size of charging stations based on genetic algorithm (GA). Target of this method is minimizing cost of conversion of gas stations to charging stations. Another considered issue is minimizing EVs losses to find neares...
متن کاملMap-merging in Multi-robot Simultaneous Localization and Mapping Process Using Two Heterogeneous Ground Robots
In this article, a fast and reliable map-merging algorithm is proposed to produce a global two dimensional map of an indoor environment in a multi-robot simultaneous localization and mapping (SLAM) process. In SLAM process, to find its way in this environment, a robot should be able to determine its position relative to a map formed from its observations. To solve this complex problem, simultan...
متن کاملRandomized Algorithm For 3-Set Splitting Problem and it's Markovian Model
In this paper we restrict every set splitting problem to the special case in which every set has just three elements. This restricted version is also NP-complete. Then, we introduce a general conversion from any set splitting problem to 3-set splitting. Then we introduce a randomize algorithm, and we use Markov chain model for run time complexity analysis of this algorithm. In the last section ...
متن کاملFacial expression recognition based on Local Binary Patterns
Classical LBP such as complexity and high dimensions of feature vectors that make it necessary to apply dimension reduction processes. In this paper, we introduce an improved LBP algorithm to solve these problems that utilizes Fast PCA algorithm for reduction of vector dimensions of extracted features. In other words, proffer method (Fast PCA+LBP) is an improved LBP algorithm that is extracted ...
متن کاملUsing both Binary and Residue Representations for Achieving Fast Converters in RNS
In this paper, a new method is introduced for improving the efficiency of the Residue Number System, which uses both binary and residue representations in order to represent a number. A residue number system uses the remainder of the division in several different modules. Conversion of a number to smaller ones and carrying out parallel calculations on these numbers greatly increase the speed of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Pattern Recognition Letters
دوره 21 شماره
صفحات -
تاریخ انتشار 2000